PSON: A scalable P2P file sharing system with efficient complex query support

A desired P2P file sharing system is expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose a powerful P2P file sharing system, PSON, which can satisfy all the three desired properties. PSON is essentially a semantic overlay network of logical nodes. Each logical node represents a cluster of peers that are close to each other. A powerful peer is selected in each cluster to support query routing on the overlay network while the less powerful peers are responsible for the maintenance of shared contents. To facilitate query routing, super peers are organized in form of a balanced binary search tree. By exploiting the concept Y. Li · J.-H. Cui (B) Computer Science & Engineering, University of Connecticut, Storrs, CT 06269, USA e-mail: [email protected] Y. Li e-mail: [email protected] J. Ahuja Yahoo Software Development India PVt Ltd, Bangalore, 560001, India e-mail: [email protected] L. Lao Google Santa Monica, 604 Arizona Avenue, Santa Monica, CA 90401, USA e-mail: [email protected] S. Chen Department of CISE, University of Florida, Gainesville, FL 32611, USA e-mail: [email protected] of semantics, PSON can support complex queries in a scalable and efficient way. In this paper, we present the basic system design such as the semantic overlay construction, query routing and system dynamics. A load balancing scheme is proposed to further enhance the system performance. By simulation experiments, we show that PSON is scalable, efficient and is able to support complex queries.